Markov inequality for polynomials of degree n with m distinct zeros
نویسندگان
چکیده
for all polynomials of degree at most n with real coefficients. There is a huge literature about Markov-type inequalities for constrained polynomials. In particular, several essentially sharp improvements are known for various classes of polynomials with restricted zeros. Here we just refer to [1], and the references therein. Let P n be the collection of all polynomials of degree at most n with real coefficients that have at most m distinct complex zeros. We prove the following.
منابع مشابه
Some compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملZeros of Random Polynomials On
For a regular compact set K in C and a measure μ on K satisfying the Bernstein-Markov inequality, we consider the ensemble PN of polynomials of degree N , endowed with the Gaussian probability measure induced by L(μ). We show that for large N , the simultaneous zeros of m polynomials in PN tend to concentrate around the Silov boundary of K; more precisely, their expected distribution is asympto...
متن کاملInequalities for Lorentz polynomials
We prove a few interesting inequalities for Lorentz polynomials. A highlight of this paper states that the Markov-type inequality max x∈[−1,1] |f (x)| ≤ n max x∈[−1,1] |f(x)| holds for all polynomials f of degree at most n with real coefficients for which f ′ has all its zeros outside the open unit disk. Equality holds only for f(x) := c((1± x) − 2n−1) with a constant 0 6= c ∈ R. This should be...
متن کاملMarkov-type Inequalities for Constrained Polynomials with Complex Coefficients
It is shown that c1n max{k + 1, log n} ≤ sup 06=p∈Pc n,k ‖p′‖[−1,1] ‖p‖[−1,1] ≤ c2n max{k + 1, log n} with absolute constants c1 > 0 and c2 > 0, where Pc n,k denotes the set of all polynomials of degree at most n with complex coefficients and with at most k (0 ≤ k ≤ n) zeros in the open unit disk. Here ‖ · ‖[−1,1] denotes the supremum norm on [−1, 1]. This result should be compared with the ine...
متن کاملMARKOV AND BERNSTEIN TYPE INEQUALITIES IN Lp FOR CLASSES OF POLYNOMIALS WITH CONSTRAINTS
The Markov-type inequality i \Ax)\dx is proved for all real algebraic polynomials/of degree at most n having at most k, with 0 ^ k < n, zeros (counting multiplicities) in the open unit disk of the complex plane, and for all p > 0, where c(p) = c(l +/T) with some absolute constant c> 0. This inequality has been conjectured since 1983 when the L^ case of the above result was proved. It improves a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 122 شماره
صفحات -
تاریخ انتشار 2003